Self-orthogonal codes from equitable partitions of distance-regular graphs
نویسندگان
چکیده
<p style='text-indent:20px;'>We give two methods for a construction of self-orthogonal linear codes from equitable partitions distance-regular graphs. By applying these methods, we construct the graph unitals in <inline-formula><tex-math id="M1">\begin{document}$ PG(2,4) $\end{document}</tex-math></inline-formula> and only known strongly regular with parameters id="M2">\begin{document}$ (216,40,4,8) $\end{document}</tex-math></inline-formula>. Some obtained are optimal.</p>
منابع مشابه
Codes in Bipartite Distance^regular Graphs
For each bipartition_of a bipartite distance-regular graph F, there naturally corresponds another distance-regular graph F called a halved graph. It is shown that the existence of a perfect e-code in a halved graph F is equivalent to the existence of a uniformly packed 2e-code in F with certain specific parameters. Using this equivalence, we show the non-existence of perfect codes for two class...
متن کاملFamilies of nested completely regular codes and distance-regular graphs
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius ρ equal to 3 or 4, and are 1/2-th parts, for i ∈ {1, . . . , u} of binary (respectively, extended binary) Hamming codes of length n = 2 − 1 (respectively, 2), where m = 2u. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs...
متن کاملSome Strongly Regular Graphs and Self-orthogonal Codes from the Unitary
We construct self-orthogonal codes from the row span over F2 or F3 of the adjacency matrices of some strongly regular graphs defined by the rank-3 action of the simple unitary group U4(3) on the conjugacy classes of some of its maximal subgroups. We establish some properties of these codes and the nature of some classes of codewords.
متن کاملOn nested completely regular codes and distance regular graphs
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
متن کاملInternal Partitions of Regular Graphs
An internal partition of an n-vertex graph G = (V,E ) is a partition of V such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every d -regular graph with n > N(d ) vertices has an internal partition. Here we prove this for d = 6. The case d = n − 4 is of particular interest and leads to interesting new open problems on cubic g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2022
ISSN: ['1930-5346', '1930-5338']
DOI: https://doi.org/10.3934/amc.2022014